Quality Improvements in Tsume Go Mass Production
نویسنده
چکیده
Based on the life/death solving program RisiKo a program GoTools was developed which includes a better human interface and which is able to generate new life/death problems together with their solutions automatically. Because the number of generated problems reached 10000 sofar, the problem of preventing repetition and of automatic classiication becomes central which includes assessing the diiculty and the grade of interest.
منابع مشابه
Search versus Knowledge for Solving Life and Death Problems in Go
In games research, Go is considered the classical board game that is most resistant to current AI techniques. Large-scale knowledge engineering has been considered indispensable for building state of the art programs, even for subproblems such as Life and Death, or tsume-Go. This paper describes the technologies behind TSUMEGO EXPLORER, a high-performance tsume-Go search engine for enclosed pro...
متن کاملMULTI-MODAL UTILE DISTINCTIONS Multi-Modal Utile Distinctions
We introduce Multi-Modal Utility Trees (MMU), an algorithm for autonomously learning decision treebased state abstractions in Partially Observable Markov Decision Processes with multi-modal observations. MMU builds the trees using the Kolmogorov-Smirnov statistical test. Additionally, MMU incorporates the ability to perform online tree restructuring, enabling it to build and maintain a compact ...
متن کاملDF-PN in Go: An Application to the One-Eye Problem
Search algorithms based on the notion of proof and disproof numbers have been shown to be effective in many games. In this paper, we modify the depth-first proof-number search algorithm df-pn, in order to apply it to the game of Go. We develop a solver for one-eye problems, a special case of enclosed tsume-Go [ life and death] problems. Our results show that this approach is very promising.
متن کاملA Survey of Tsume-Shogi Programs Using Variable-Depth Search
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Publications on this research domain have been written mainly in Japanese. To present the findings of this research to a wider audience, we compare six different tsume programs. To find the solutions of difficult tsume-shog...
متن کاملLearning a Go Heuristic with TILDE
In Go, an important factor that hinders search is the large branching factor, even in local problems. Human players are strong at recognizing frequently occurring shapes and vital points. This allows them to select the most promising moves and to prune the search tree. In this paper we argue that many of these shapes can be represented as relational concepts. We present an application of the re...
متن کامل